Optimal trade-off for Merkle tree traversal

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal trade-off for merkle tree traversal

In this paper we describe optimal trade-offs between time and space complexity of Merkle tree traversals with their associated authentication paths, improving on the previous results of M. Jakobsson, T. Leighton, S. Micali, and M. Szydlo [Fractal Merkle tree representation and traversal, in: RSA Cryptographers Track, RSA Security Conference, 2003] and M. Szydlo [Merkle tree traversal in log spa...

متن کامل

Merkle Tree Traversal Revisited

We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.

متن کامل

Fractal Merkle Tree Representation and Traversal

We introduce a technique for traversal of Merkle trees, and propose an efficient algorithm that generates a sequence of leaves along with their associated authentication paths. For one choice of parameters, and a total of N leaves, our technique requires a worst-case computational effort of 2 log N/loglog N hash function evaluations per output, and a total storage capacity of less than 1.5 log ...

متن کامل

Merkle Tree Traversal in Log Space and Time

We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log 2 (N) and space less than 3 log 2 (N), where the units of computation are hash function evaluations or leaf value computations, and the units of space are the number of node values stor...

متن کامل

Slightly Improved Merkle Tree Traversal for User Authentication Using Pseudorandomly-Generated Leaves

Merkle trees can be used for a variety of cryptographic purposes, including digital signatures and user authentication. We describe a technique for pseudorandomly generating the private values corresponding to the leaves of a Merkle tree from a common seed. The technique allows for secure user authentication with fewer hash function evaluations required to generate the authentication data. Usin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2007

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2006.11.029